Learning Monotonic Transformations for Classification

نویسندگان

  • Andrew Howard
  • Tony Jebara
چکیده

A discriminative method is proposed for learning monotonic transformations of the training data while jointly estimating a large-margin classifier. In many domains such as document classification, image histogram classification and gene microarray experiments, fixed monotonic transformations can be useful as a preprocessing step. However, most classifiers only explore these transformations through manual trial and error or via prior domain knowledge. The proposed method learns monotonic transformations automatically while training a large-margin classifier without any prior knowledge of the domain. A monotonic piecewise linear function is learned which transforms data for subsequent processing by a linear hyperplane classifier. Two algorithmic implementations of the method are formalized. The first solves a convergent alternating sequence of quadratic and linear programs until it obtains a locally optimal solution. An improved algorithm is then derived using a convex semidefinite relaxation that overcomes initialization issues in the greedy optimization problem. The effectiveness of these learned transformations on synthetic problems, text data and image data is demonstrated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

دو روش تبدیل ویژگی مبتنی بر الگوریتم های ژنتیک برای کاهش خطای دسته بندی ماشین بردار پشتیبان

Discriminative methods are used for increasing pattern recognition and classification accuracy. These methods can be used as discriminant transformations applied to features or they can be used as discriminative learning algorithms for the classifiers. Usually, discriminative transformations criteria are different from the criteria of  discriminant classifiers training or  their error. In this ...

متن کامل

Implementability under monotonic transformations in differences

Consider a social choice setting in which agents have quasilinear utilities over monetary transfers. A domain D of admissible valuation functions of an agent is called a revenue monotonicity domain if every 2-cycle monotone allocation rule is truthfully implementable (in dominant strategies) and satisfies revenue equivalence. We introduce the notions of monotonic transformations in differences,...

متن کامل

Ulam's method for random interval maps

We consider the approximation of absolutely continuous invariant measures (ACIMs) of systems defined by random compositions of piecewise monotonic transformations. Convergence of Ulam’s finite approximation scheme in the case of a single transformation was dealt with by Li (1976 J. Approx. Theory 17 177–86). We extend Ulam’s construction to the situation where a family of piecewise monotonic tr...

متن کامل

Monotonic classification extreme learning machine

Monotonic classification problems mean that both feature values and class labels are ordered and monotonicity relationships exist between some features and the decision label. Extreme Learning Machine (ELM) is a singlehidden layer feedforward neural network with fast training rate and good generalization capability, but due to the existence of training error, ELM cannot be directly used to hand...

متن کامل

Degrees of Monotonicity of Spatial Transformations

We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hierarchy of monotonicity classes of spatial transformations that is determined by the number of degrees of freedom of the transformations. The result of a monotonic transformation with k degrees of freedom on a spatial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007